Automatic Generation of Smooth Paths Bounded by Polygonal Chains
نویسندگان
چکیده
We consider the problem of planning smooth paths for a vehicle in a region bounded by polygonal chains. The paths are represented as B-spline functions. A path is found by solving an optimization problem using a cost function designed to care for both the smoothness of the path and the safety of the vehicle. Smoothness is defined as small magnitude of the derivative of curvature and safety is defined as the degree of centering of the path between the polygonal chains. The polygonal chains are preprocessed in order to remove excess parts and introduce safety margins for the vehicle. The method has been implemented for use with a standard solver and tests have been made on application data provided by the Swedish mining company LKAB.
منابع مشابه
Optimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...
متن کاملShort and Smooth Polygonal Paths
Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Some of these require the incorporation of some information about the polygonal shape without being too far from the actual shortest path. We present an algorithm to compute a locally convex region that “contains” the shortest Euc...
متن کاملApproximating Polygonal Objects by Deformable Smooth Surfaces
We propose a method to approximate a polygonal object by a deformable smooth surface, namely the t-skin defined by Edelsbrunner [5] for all 0 < t < 1. We guarantee that they are homeomorphic and their Hausdorff distance is at most > 0. This construction make it possible for fully automatic, smooth and robust deformation between two polygonal objects with different topologies. En route to our re...
متن کاملDiscrete Dubins Paths
A Dubins path is a shortest path with bounded curvature. The seminal result in nonholonomic motion planning is that (in the absence of obstacles) a Dubins path consists either from a circular arc followed by a segment followed by another arc, or from three circular arcs [Dubins, 1957]. Dubins original proof uses advanced calculus; later, Dubins result was reproved using control theory technique...
متن کاملCounterexample Generation for Markov Chains Using SMT-Based Bounded Model Checking
Generation of counterexamples is a highly important task in the model checking process. In contrast to, e. g., digital circuits where counterexamples typically consist of a single path leading to a critical state of the system, in the probabilistic setting counterexamples may consist of a large number of paths. In order to be able to handle large systems and to use the capabilities of modern SA...
متن کامل